cyclomatic

Look at other dictionaries:

• Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program …   Wikipedia

• Cyclomatic complexity — Die McCabe Metrik (auch zyklomatische Komplexität cyclomatic complexity) ist eine Software Metrik, mit der die Komplexität eines Software Moduls gemessen werden kann. Die zyklomatische Komplexität wurde bereits 1976 durch Thomas J. McCabe… …   Deutsch Wikipedia

• cyclomatic number —   the number of circuits in a network …   Geography glossary

• Цикломатическая сложность — программы (англ. Cyclomatic complexity of a program)  структурная (или топологическая) мера сложности программ, используемая для измерения качества программного обеспечения, основанная на методах статического анализа кода. ЦСП равна… …   Википедия

• Essential complexity — refers to a situation where all reasonable solutions to a problem must be complicated (and possibly confusing) because the simple solutions would not adequately solve the problem. It stands in contrast to accidental complexity, which arises… …   Wikipedia

• Software Quality Model — Software quality can be defined as conformance to requirements and/or fitness of use . Quality achievements start with a loud and clear definition of what quality of source code means to your organization or project. In simple terms all the… …   Wikipedia

• Software metric — A software metric is a measure of some property of a piece of software or its specifications.Since quantitative methods have proved so powerful in the other sciences, computer science practitioners and theoreticians have worked hard to bring… …   Wikipedia

• MCC — may refer to:Business, government and non profit organizations; Business related Topics * Merchant Category Code, a code assigned to companies accepting credit cards.; Business Corporations * Mitsubishi Chemical Corporation * Manhattan… …   Wikipedia

• Circuit rank — The circuit rank of a graph G (also known as the cyclomatic number of G) is the minimum number r of edges to remove from the graph to make it cycle free. It has the formula r = m − n + c, where m is the number |E(G)| of edges in G, n is the… …   Wikipedia

• Panopticode — The Panopticode free software / open source project provides a standardized format for describing the structure of software projects and integrates Software metrics from several tools into that format. Reporting options provide correlation and… …   Wikipedia